Periodic comparator networks
نویسنده
چکیده
We survey recent results on periodic algorithms. We focus on the problems of sorting, merging and permuting and concentrate on algorithms that have small constant periods.
منابع مشابه
Fast and Feasible Periodic Sorting Networks of Constant Depth
A periodic comparator network has depth (or period) k, if for every t > k, the compare-exchange operations performed at step t are executed between exactly the same registers as at step t k. We introduce a general method that converts an arbitrary comparator network that sorts n items in time T(n) and that has layout area A into a periodic sorting network of depth 5 that sorts O(n .T(n)) items ...
متن کاملConstructing sorting networks with constant period yKrzysztof
We consider comparator networks M which are used repeatedly: while the output produced by M is not sorted, it is fed again into M. Sorting algorithms working in this way are called periodic. The number of parallel steps performed during a single run of M is called its period, the sorting time of M is the total number of parallel steps that are necessary to sort in the worst case. Periodic sorti...
متن کاملFaster 3-Periodic Merging Networks
We consider the problem of merging two sorted sequences on a comparator network that is used repeatedly, that is, if the output is not sorted, the network is applied again using the output as input. The challenging task is to construct such networks of small depth. The first constructions of merging networks with a constant period were given by Kutyłowski, Loryś and Oesterdikhoff [7]. They have...
متن کاملFaster Small-Constant-Periodic Merging Networks
We consider the problem of merging two sorted sequences on a comparator network that is used repeatedly, that is, if the output is not sorted, the network is applied again using the output as input. The challenging task is to construct such networks of small depth (called a period in this context). In our previous paper Faster 3-Periodic Merging Network we reduced twice the time of merging on 3...
متن کاملFast Periodic Correction Networks
We consider the problem of sorting N-element inputs differing from already sorted sequences on t entries. To perform this task we construct a comparator network that is applied periodically. The two constructions for this problem made by previous authors required O(logn+ t) iterations of the network. Our construction requires O(logn + (log logN)2(log t)3) iterations which makes it faster for t ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 245 شماره
صفحات -
تاریخ انتشار 2000